Trapdoor function - PDFSEARCH.IO - Document Search Engine

Trapdoor function
Results: 22

#	Item
1	Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany Add to Reading List Source URL: www.cits.rub.de Language: English - Date: 2014-11-18 10:03:56 Cryptography Permutations Combinatorics Trapdoor function NC RSA Optimal asymmetric encryption padding Permutation Parity of a permutation Factorial Integer factorization
2	The proceedings version of this paper appears in CCSThis is the full paper, an earlier version of which was circulated under the title “Garbling Schemes”. Foundations of Garbled Circuits Mihir Bellare1 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-06-30 14:22:04 Cryptography Circuit complexity Trapdoor function Data Encryption Standard Circuit Function Secure multi-party computation
3	Extending Nymble-like Systems Ryan Henry and Ian Goldberg Cheriton School of Computer Science University of Waterloo Waterloo, ON, Canada N2L 3G1 {rhenry,iang}@cs.uwaterloo.ca Add to Reading List Source URL: homes.soic.indiana.edu Language: English - Date: 2016-05-12 20:00:31 E-commerce RSA Trapdoor function Euclidean algorithm Water Sheaf XTR
4	A Provably Secure Elliptic Curve Scheme with Fast Encryption David Galindo1 , Sebasti` a Mart´ın1 , Tsuyoshi Takagi2 and Jorge L. Villar1 1 Add to Reading List Source URL: www.dgalindo.es Language: English - Date: 2007-11-26 10:35:53 Cryptography Abstract algebra Algebra Elliptic curves Group theory Supersingular elliptic curve Trapdoor function Finite fields Elliptic curve Lenstra elliptic curve factorization Elliptic curve primality
5	Easy Verifiable Primitives and Practical Public Key Cryptosystems David Galindo, Sebasti`a Mart´ın, Paz Morillo and Jorge L. Villar Dep. Matem` atica Aplicada IV. Universitat Polit`ecnica de Catalunya Campus Nord, c/Jo Add to Reading List Source URL: www.dgalindo.es Language: English - Date: 2007-11-26 10:35:45 Cryptography Ciphertext indistinguishability Paillier cryptosystem Probabilistic encryption CramerShoup cryptosystem ElGamal encryption Chosen-ciphertext attack Cryptosystem Advantage Trapdoor function Feistel cipher RSA
6	An Attack Against Fixed Value Discrete Logarithm Representations Gergely Alp´ ar1,2⋆ , Jaap-Henk Hoepman1,2 , and Wouter Lueks1,2⋆⋆ 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-02-28 05:16:42 Binary operations Finite fields Computational hardness assumptions Group theory Trapdoor function Public-key cryptography One-way function Exponentiation Discrete logarithm Cryptography Abstract algebra Mathematics
7	Minimal Assumptions for Efficient Mercurial Commitments∗ Yevgeniy Dodis† Abstract Mercurial commitments were introduced by Chase et al. [8] and form a key building block for constructing zero-knowledge sets (introduc Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-11-30 14:18:39 Cryptographic protocols Trapdoor function Claw-free permutation One-way function Zero-knowledge proof XTR Mercurial Permutation Communications protocol Cryptography Public-key cryptography Commitment scheme
8	Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations? Dario Fiore1 and Dominique Schr¨oder2 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2011-09-15 13:18:51 One-way function Pseudorandom generator theorem Hard-core predicate Random oracle Verifiable random function Trapdoor function Pseudorandom function family Pseudorandom generator Pseudorandom permutation Cryptography Pseudorandomness Cryptographic hash functions
9	On the Impossibility of Instantiating PSS in the Standard Model Rishiraj Bhattacharyya1 and Avradip Mandal2 1 Cryptology Research Group, Applied Statistics Unit, Indian Statistical Institute, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2010-12-21 12:09:46 Optimal asymmetric encryption padding Claw-free permutation Combinatorics One-way function Advantage Random oracle Parity of a permutation Trapdoor function Full Domain Hash Cryptography Permutations Cryptographic hash functions
10	A Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions Donghoon Chang Center for Information Security Technologies(CI Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2006-12-21 12:10:24 Block cipher Hash function One-way compression function Merkle–Damgård construction Cryptography Cryptographic hash functions Collision attack

UPDATE